Computational Learning Theory Spring Semester , 2009 / 10 Lecture 11 : Sponsored search

نویسندگان

  • Yishay Mansour
  • Alon Levin
چکیده

Search engines like Google and Yahoo! monetize their services by auctioning off advertising space next to their search results. For example, Apple may bid to appear among the advertisements whenever users search for ”ipod”. These sponsored results look similar to the search results. Each position in the sponsored results is called Slot. Generally, advertisements that appear in a higher ranked slot (higher on the page) garner more attention and more clicks from users. Thus, all else being equal, merchents generally prefer higher ranked slots to lower ranked slots. Advertisers bid for placement on the page in an auction-style format where the higher their-bid the more likely their adverstiment will appear above other advertisements on the page. By convension, sponsored search advertisers generally pay per click, namely, the merchant pays only when the user clicks on the adverstiment.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computational Learning Theory Lecture Notes for CS Spring Semester

1 Preface This manuscript is a compliation of lecture notes from the graduate level course CS 582, \Computational Learning Theory," I taught a t W ashington University in the spring of 1991. Students taking the course were assumed to have b a c kground in the design and analysis of algorithms as well as good mathematical background. Given that there is no text available on this subject, the cou...

متن کامل

Computational Game Theory Spring Semester , 2009 / 2010 Lecture 5 : 2 - Player Zero Sum Games

are completely competitive, where whatever one player wins, the other loses. Examples of such games include chess, checkers, backgammon, etc. We will show that in such games: • An equilibrium always exists (although not necessarily a pure one); • All equilibrium points yield the same payoff for the players; • The set of equilibrium points is actually the cartesian product of independent sets of...

متن کامل

Computational Learning Theory Spring Semester , 2003 / 4 Lecture 2 : March 9

• Assume there is a network of parallel lines from an origin to a destination as shown in figure 2.1. Several agents want to send a particular amount of traffic along a path from the source to the destination. The more traffic on a particular line, the longer the traffic delay. • Allocation jobs to machines as shown in figure 2.2. Each job has a different size and each machine has a different s...

متن کامل

Computational Game Theory Spring Semester , 2009 / 10 Lecture 7 : April 28 , 2010

1 Regret Minimization In this lecture, our goal is to build a strategy with good performance when dealing with repeated games. Let us start with a simple model of regret. In this model a player performs a partial optimization on his actions. Following each action he updates his belief and selects the next actions, dependent on the outcome. We will also show that for a familty of games, socially...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010